Nordi Journal of Computing DISTRIBUTED STRING MATCHING WITH TRANSLATION INVARIANCE

Radial Projection Fourier Transform and its Application for Scene Matching with Rotation Invariance

Scene matching is used for image registration in many fields. There are usually translation and an arbitrary unknown rotation angle between reference and template images. The corresponding scene matching algorithm costs far more computing time than that with small rotation angle and translation. Conceptions of generalized vector image, gray-scale image rotation transformation, gray-scale image ...

Restricted Transposition Invariant Approximate String Matching Under Edit Distance

Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and searching for approximate occurrences of A inside B. We consider the classic Levenshtein distance, but the discussion is applicable also to indel distance. A relatively new variant [8] of string matching, motivated in...

Nordi Journal of Computing COMONADIC ITERATION

تبدیلات دوگانگی آبلی استاندارد در گرانش f(T)

According to the perturbation order, the equations of motion of low-energy string effective action are the generalized Einstein equations. Thus, by making use of the conformal transformation of  the metric tensor, it is possible to map the low-energy string effective action into f(T) gravity, relating the dilaton field to the torsion scalar. Considering a homogeneous and isotropic universe and ...

Searching Monophonic Patterns within Polyphonic Sources

The string matching problem for strings in which one should find the occurrences of a pattern string within a text, is well-studied in the past literature. The problem can be solved efficiently, e.g., by using so-called bit-parallel algorithms. We adapt the bit-parallel approach to music information retrieval. We consider a situation where the pattern is monophonic and the text (the musical sou...